Largest 2-Regular Subgraphs in 3-Regular Graphs
نویسندگان
چکیده
منابع مشابه
Three-regular Subgraphs of Four-regular Graphs'
The Berge–Sauer conjecture (see [2, 3]) says that any simple (no multiple edges and loops) 4-regular graph contains a 3-regular subgraph. This conjecture was proved in [4, 6]. In [1, 2] the Chevalley–Warning theorem was used to extend this result to graphs with multiple edges, which are 4-regular plus an edge. Our main result, Theorem 2.2, presents the sufficient condition for a 4-regular graph...
متن کاملRegular subgraphs of almost regular graphs
Suppose every vertex of a graph G has degree k or k + 1 and at least one vertex has degree k + 1. It is shown that if k > 2q 2 and q is a prime power then G contains a q-regular subgraph (and hence an r-regular subgraph for all r < q. r = q (mod 2)). It is also proved that every simple graph with maximal degree A > 2q 2 and average degree d > ((2q 2)/(2q l))(A + 1), where q is a prime power, co...
متن کاملRegular subgraphs of random graphs
In this paper, we prove that there exists a function ρk = (4 + o(1))k such that G(n, ρ/n) contains a k-regular graph with high probability whenever ρ > ρk. In the case of k = 3, it is also shown that G(n, ρ/n) contains a 3-regular graph with high probability whenever ρ > λ ≈ 5.1494. These are the first constant bounds on the average degree in G(n, p) for the existence of a k-regular subgraph. W...
متن کاملOn Subgraphs in Distance-Regular Graphs
Terwilliger [15] has given the diameter bound d < (s 1)(k 1) + 1 for distance-regular graphs with girth 2s and valency k. We show that the only distance-regular graphs with even girth which reach this bound are the hypercubes and the doubled Odd graphs. Also we improve this bound for bipartite distance-regular graphs. Weichsel [17] conjectures that the only distance-regular subgraphs of a hyper...
متن کاملDecompositions of Complete Graphs into Bipartite 2-Regular Subgraphs
It is shown that if G is any bipartite 2-regular graph of order at most n2 or at least n − 2, then the obvious necessary conditions are sufficient for the existence of a decomposition of the complete graph of order n into a perfect matching and edge-disjoint copies of G.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2019
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-019-02021-6